nonempty intersection

См. также в других словарях:

• Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… …   Wikipedia

• Intersection graph — In the mathematical area of graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph may be represented as an intersection graph, but some important special classes of graphs may… …   Wikipedia

• Intersection (set theory) — Intersections of the Greek, Latin and Russian alphabet (upper case graphemes) (The intersection of Greek and Latin letters is used for the Greek licence plates.) …   Wikipedia

• Finite intersection property — In general topology, the finite intersection property is a property of a collection of subsets of a set X . A collection has this property if the intersection over any finite subcollection of the collection is nonempty.DefinitionLet X be a set… …   Wikipedia

• finite intersection property — Math. the property of a collection of nonempty sets in which the intersections of all possible finite numbers of the sets each contain at least one element. * * * …   Universalium

• finite intersection property — Math. the property of a collection of nonempty sets in which the intersections of all possible finite numbers of the sets each contain at least one element …   Useful english dictionary

• Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… …   Wikipedia

• Helly's theorem — In geometry, Helly s theorem is a basic combinatorial result on convex sets. It was proved by Eduard Helly in 1923, and gave rise to the notion of Helly family.tatement of Helly s theorem:Suppose that::X 1,X 2,dots,X n :is a finite collection of… …   Wikipedia

• Filter (mathematics) — The powerset algebra of the set {1,2,3,4} with the upset colored green. The green elements make a principal ultrafilter on the lattice. In mathematics, a filter is a special subset of a partially ordered set. A frequently used special case is the …   Wikipedia

• Non-standard analysis — Abraham Robinson Gottfried Wilhelm Leibniz argued tha …   Wikipedia

• Compact space — Compactness redirects here. For the concept in first order logic, see compactness theorem. In mathematics, specifically general topology and metric topology, a compact space is an abstract mathematical space whose topology has the compactness… …   Wikipedia